Games in TLA

نویسنده

  • Can BAŞKENT
چکیده

The so-called “new machinery for computing” was early computers, and ACM considered it a machinery for “reasoning .. of information”. However, the computers are not the only models for information change. The exciting history of derivations (or so called syllogisms) go back till Aristotle, and gained so much importance in Medieval ages via the rise of logical discourse among religious scholars. The manipulation of information was investigated by numerous philosophers including Aristotle, Boethius, Abelard etc (3). The very same tradition of information manipulation based on some strict rules survived until the ground breaking work of George Boole. When people still utter the fact that the computers depend on Boolean logic, not only a true fact of formal sciences is exposed, but also the significance of the idea formalization of a structure is underlined by praising G. Boole the logician. There are several methods and strategies to formalize the intuitions that computers use1. The engineering based approach shaped the mechanism and

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Definitional Encoding of TLA* in Isabelle/HOL

We mechanise the logic TLA∗ [8], an extension of Lamport’s Temporal Logic of Actions (TLA) [5] for specifying and reasoning about concurrent and reactive systems. Aiming at a framework for mechanising the verification of TLA (or TLA∗) specifications, this contribution reuses some elements from a previous axiomatic encoding of TLA in Isabelle/HOL by the second author [7], which has been part of ...

متن کامل

Teacher Language Awareness from the Procedural Perspective: The Case of Novice versus Experienced EFL Teachers

Despite the abundance of research on ELT teachers, little is known about teacher language awareness (TLA) with focus on its impact on pedagogical practice in the EFL context. To fill this gap, an in-depth study was conducted to examine the procedural dimension of TLA among eight EFL teachers with different teaching experiences (novice versus experienced) related to teaching grammar at Iranian l...

متن کامل

On TLA

We describe the Temporal Logic of Actions (TLA) from a logical perspective. After giving the syntax and semantics of TLA, we discuss some methods for representing reactive systems in TLA and study veriication rules. 1 The L in TLA The Temporal Logic of Actions (TLA) is a variant of temporal logic, designed for the speciication and veriication of reactive systems in terms of their actions. In th...

متن کامل

A TLA+ Proof System

We describe an extension to the TLA specification language with constructs for writing proofs and a proof environment, called the Proof Manager (PM), to checks those proofs. The language and the PM support the incremental development and checking of hierarchically structured proofs. The PM translates a proof into a set of independent proof obligations and calls upon a collection of back-end pro...

متن کامل

Model Checking TLA+ Specifications

TLA is a specification language for concurrent and reactive systems that combines the temporal logic TLA with full first-order logic and ZF set theory. TLC is a new model checker for debugging a TLA specification by checking invariance properties of a finite-state model of the specification. It accepts a subclass of TLA specifications that should include most descriptions of real system designs...

متن کامل

Towards certification of TLA+ proof obligations with SMT solvers

TLA+ is a formal specification language that is based on Zermelo-Fränkel set theory and the Temporal Logic of Actions TLA. The TLA+ proof system TLAPS assists users in deductively verifying safety properties of TLA+ specifications. TLAPS is built around a proof manager, which interprets the TLA+ proof language, generates corresponding proof obligations, and passes them to backend verifiers. In ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011